A meta-language for typed object-oriented languages
نویسندگان
چکیده
منابع مشابه
A Meta-Language for Typed Object-Oriented Languages
In [13] we defined the λ&-calculus, a simple extension of the typed λcalculus to model typed object-oriented languages. This paper is the continuation or, rather, the companion of [13] since it analyzes the practical counterpart of the theoretical issues introduced there. Indeed, to develop a formal study of type systems for object-oriented languages we define a meta-language based on λ& and we...
متن کاملLogical foundations for typed object-oriented languages
This paper presents logical foundations for the most important object-oriented language features, including abstract types, dynamic binding, subtyping, and inheritance. These foundations are introduced along with an object-oriented kernel language. We show how object environments of such languages can be formalized in an algebraic way. Based on this foundation, we develop a Hoare-style logic fo...
متن کاملA Deductive and Typed Object-Oriented Language
1 I n t r o d u c t i o n a n d r e s u l t s In the last decade, the merge of object-oriented programming with object-oriented data structuring principles has lead to a rapid increasement of new developments in the field of databases and logical languages. Object-oriented databases have the advantages of a clean conceptual design as well as the possibility of enforcing better software engineer...
متن کاملBoogiePL: A typed procedural language for checking object-oriented programs
This note defines BoogiePL, an intermediate language for program analysis and program verification. The language is a simple coarsely typed imperative language with procedures and arrays, plus support for introducing mathematical functions and declaring properties of these functions. BoogiePL can be used to represent programs written in an imperative source language (like an object-oriented .NE...
متن کاملCompact Dispatch Tables for Dynamically Typed Object Oriented Languages
Dynamically typed object-oriented languages must perform dynamic binding for most message sends. Typically this is slow. A number of papers have reported on attempts to adapt C++-style selector table indexing to dynamically typed languages, but it is difficul to generate space-efficient tables. Our algorithm generates considerably smaller dispatch tables for languages with single inheritance th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1995
ISSN: 0304-3975
DOI: 10.1016/0304-3975(95)00071-4